Comparison of lightweight and compute - intensive heuristics for DAG scheduling with network contention
نویسندگان
چکیده
The aim of this Master’s thesis is the investigation of schedule qualities by extending the HEFT algorithm and a Genetic Algorithm to contention-aware scheduling heuristics. Both algorithms are modified in terms of transfer times for simultaneously data connections inside the cluster to explore potential advantages of the GA on the one hand, and the increasing complexity of the problem on the other hand compared to the originally proposed versions of the algorithms.
منابع مشابه
Comparison of Contention Aware List Scheduling Heuristics for Cluster Computing
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a Directed Acyclic Graph (DAG) to a target machine. As most heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the inter communication links. This article extends the list scheduling heuristic for contention aware sch...
متن کاملList scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures
In the area of static scheduling, list scheduling is one of the most common heuristics for the temporal and spatial assignment of a directed acyclic graph (DAG) to a target system. As most scheduling heuristics, list scheduling assumes fully connected homogeneous processors and ignores contention on the communication links. This article extends the list scheduling heuristic for contention aware...
متن کاملA List Scheduling Heuristic with New Node Priorities and Critical Child Technique for Task Scheduling with Communication Contention
Task scheduling is an important aspect for parallel programming. In this paper, the program to be scheduled is modeled as a Directed Acyclic Graph (DAG), and we target parallel embedded systems of multiple processors connected by buses and switches. This paper presents improvements for list scheduling heuristics with communication contention. We use new node priorities (top level and bottom lev...
متن کاملScheduling Tasks and Communications on a Hierarchical System with Message Contention
A Directed Acyclic Graph (DAG) of tasks with small communication delays has to be scheduled on the identical parallel processors of clusters connected by a hierarchical network. The number or processors and of clusters is not limited. Message contention has to be avoided. Task duplication is allowed. In this paper, we present a new polynomial algorithm that computes the earliest start dates of ...
متن کاملA bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics
This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017